The Complexity Register: A Collaborative Tool for System Complexity Evaluation
نویسندگان
چکیده
As modern engineered systems become ever more connected and interdependent there is an increasing need to evaluate their complexity. However, evaluating system complexity challenging due the ...
منابع مشابه
the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولThe complexity of register allocation
In compilers, register allocation is one of the most important stages with respect to optimization for typical goals, such as code size, code speed, or energy efficiency. Graph theoretically, optimal register allocation is the problem of finding a maximum weight r-colorable induced subgraph in the conflict graph of a given program. The parameter r is the number of registers. Large classes of pr...
متن کاملInteractional complexity development, interactional demonstrators and interaction density in collaborative and e-collaborative writing modalities
This study aimed at investigating the potential of collaborative and e-collaborative writing modalities in developing interactional complexity, utilization of interactional demonstrators and density of interaction. To this end, 66 Iranian intermediate female English as foreign language learners (EFL) were selected to participate in this study according to their scores on Oxford Placement Test (...
متن کاملBetter Complexity Bounds for Cost Register Automata
Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...
متن کاملBetter Complexity Bounds for Cost Register Machines
Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering management journal
سال: 2021
ISSN: ['1042-9247', '2377-0643']
DOI: https://doi.org/10.1080/10429247.2020.1858643